Adding Action Refinement to a Finite Process Algebra
نویسندگان
چکیده
منابع مشابه
Action Refinement in Process Algebra and Security Issues
In the design process of distributed systems we may have to replace abstract specifications of components by more concrete specifications, thus providing more detailed design information. In the context of process algebra, this well-known approach is often referred to as action refinement. We study the relationships between action refinement and security properties within the Security Process A...
متن کاملDeciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement
We propose two techniques for expressing the ST semantics for terms of a process algebra. The first technique, which is more intuitive, is based on the idea of giving unique names to actions and allows to decide and axiomatize weak ST bisimulation for all processes that possess a finite state interleaving semantics. The second technique, which is based on pointers, allows to preserve the possib...
متن کاملA Complete Finite Prefix for Process Algebra
In this paper we show how to use McMillan’s complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model. We present a simple adequate order (using an order on process algebra expressions) as an optimization to McMillan’s original algorithm.
متن کاملFrom Kleene Algebra to Refinement Algebra
KAT (Kleene Algebra with Tests) have proved to be useful for reasoning about programs in a partial correctness framework. We describe DRA (demonic Re nement Algebra), a variation of KAT for total correctness and illustrate its modeling and reasoning power with a number of applications and examples. TUCS Laboratory TUCS Learning and Reasoning Laboratory
متن کاملSystems, Properties and Refinement within a Process Algebra Framework
Process algebras are mathematical frameworks which can be used to provide behavioural descriptions of systems. The behaviours are described in terms of processes which are autonomous units of behaviour whose evolution are synchronised through the occurrence of events. Within the process algebra there is a class of operators which permit the direct specification of behaviours. The guarding and c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1994
ISSN: 0890-5401
DOI: 10.1006/inco.1994.1096